Computational problems

Results: 809



#Item
31EVALUATING BENCHMARK PROBLEMS BY RANDOM GUESSING J¨ urgen Schmidhuber IDSIA Corso Elvezia 36

EVALUATING BENCHMARK PROBLEMS BY RANDOM GUESSING J¨ urgen Schmidhuber IDSIA Corso Elvezia 36

Add to Reading List

Source URL: www.bioinf.jku.at

Language: English - Date: 2015-10-02 01:16:05
32On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: +

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2015-05-18 12:16:02
33Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013

Approximating Bin Packing within O(log OP T · log log OP T ) bins Thomas Rothvoß Department of Mathematics, MIT TCS+ Online Seminar May 22, 2013

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
34CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-09-29 11:39:15
35–Independent Work Report Spring,2014– Exploring Self-Organizing Learning Groups in an Online Learning Platform: Classroom Salon Brandon Lam Advisor: Dr. Ananda Gunawardena

–Independent Work Report Spring,2014– Exploring Self-Organizing Learning Groups in an Online Learning Platform: Classroom Salon Brandon Lam Advisor: Dr. Ananda Gunawardena

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2014-05-16 16:36:56
36A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

Add to Reading List

Source URL: tandy.cs.illinois.edu

Language: English - Date: 2015-04-08 19:35:45
37Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Language: English - Date: 2016-06-22 05:23:03
38The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2003-12-08 11:12:51
39TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel

Add to Reading List

Source URL: www.iwr.uni-heidelberg.de

Language: English - Date: 2013-06-19 04:16:58
40An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract

An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2010-05-19 04:29:26